State-Set Bran hing: Leveraging OBDDs for Heuristi Sear h
نویسندگان
چکیده
منابع مشابه
A Compositional Framework for Sear hChiu
Primitive Engine Model Engine Tree Search Engine First Operator Abstract Engine Print Engine Last Operator Composition Operator Abstract Composite Engine The two main fun tions of engines are init and next solution. Figure 2 shows the design of an engine. The init fun tion a epts a store as argument and prepares the engine for generating the output stream of stores. The next solution fun tion r...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms and Matroid Optimization Problems
We analyze the performan e of evolutionary algorithms on various matroid optimization problems that en ompass a vast number of e iently solvable as well as NP-hard ombinatorial optimization problems (in luding many well-known examples su h as minimum spanning tree and maximum bipartite mat hing). We obtain very promising bounds on the expe ted running time and quality of the omputed solution. O...
متن کاملForward - Fast - Sear h : Another Fast Variant of the Boyer - Moore String
Abstra t. We present a variation of the Fast-Sear h string mat hing algorithm, a re ent member of the large family of Boyer-Moore-like algorithms, and we ompare it with some of the most e e tive string mat hing algorithms, su h as Horspool, Qui k Sear h, Tuned Boyer-Moore, Reverse Fa tor, Berry-Ravindran, and Fast-Sear h itself. All algorithms are ompared in terms of run-time e ien y, number of...
متن کاملForward - Fast - Sear h : Another Fast Variant of the Boyer - Moore String Mat
Abstra t. We present a variation of the Fast-Sear h string mat hing algorithm, a re ent member of the large family of Boyer-Moore-like algorithms, and we ompare it with some of the most e e tive string mat hing algorithms, su h as Horspool, Qui k Sear h, Tuned Boyer-Moore, Reverse Fa tor, Berry-Ravindran, and Fast-Sear h itself. All algorithms are ompared in terms of run-time e ien y, number of...
متن کاملImproving stati ordering of BDDs for rea hability analysis
Jorgiano Vidal David D eharbe DIMAp/UFRN, Natal, RN, Brazil Dominique Borrione TIMA, Grenoble, Fran e Abstra t Binary de ision diagrams (BDDs) are used for automati synthesis and formal veri ation of ombinational and sequential ir uits. However, a larger adoption of these te hnologies for sequential designs still depends on a more eÆ ient use of BDDs. One important fa tor is the order of the va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002